package com.lyz.dataStructure.考研上机编程题;/**
 * @Author:759057893@qq.com Lyz
 * @Date: ${Date} 20:27
 * @Description:
 **/

import java.util.Scanner;

/**
 *@Author:759057893@qq.com Lyz
 *@Date: 2019/9/17 20:27
 *@Description:
 **/
/*
求正整数N(N>1)的质因数的个数。 相同的质因数需要重复计算。如120=2*2*2*3*5，共有5个质因数。
 */
public class 求质因数个数 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()){
           int n = sc.nextInt();
            System.out.println(returnNum(n));
        }
    }

    public  static  int returnNum(int n){
        if(n<=1) return -1;
        int count = -1;
        for(int i =2;i*i<=n;i++){
            if(n%i==0){
                count = i;
                break;
            }
        }
        if(count==-1){
            return 1;
        }else {
            int m = returnNum(n/count)+1;
            return m;
        }

    }
}
